Max{min Ant System and Local Search for the Traveling Salesman Problem
نویسنده
چکیده
| Ant System is a general purpose algorithm inspired by the study of the behavior of Ant Colonies. It is based on a cooperative search paradigm that is applicable to the solution of combinatorial optimization problems. In this paper we introduce MAX{MIN Ant System, an improved version of basic Ant System, and report our results for its application to symmetric and asymmetric instances of the well known Traveling Salesman Problem. We show how MAX{MIN Ant System can be signiicantly improved extending it with local search heuristics. Our results clearly show that MAX{MIN Ant System has the property of eeec-tively guiding the local search heuristics towards promising regions of the search space by generating good initial tours.
منابع مشابه
A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملConsultant-Guided Search Algorithms with Local Search for the Traveling Salesman Problem
Consultant-Guided Search (CGS) is a recent metaheuristic for combinatorial optimization problems, which has been successfully applied to the Traveling Salesman Problem (TSP). In experiments without local search, it has been able to outperform some of the best Ant Colony Optimization (ACO) algorithms. However, local search is an important part of any ACO algorithm and a comparison without local ...
متن کاملMAX-MIN Ant System
Ant System, the first Ant Colony Optimization algorithm, showed to be a viable method for attacking hard combinatorial optimization problems. Yet, its performance, when compared to more fine-tuned algorithms, was rather poor for large instances of traditional benchmark problems like the Traveling Salesman Problem. To show that Ant Colony Optimization algorithms could be good alternatives to exi...
متن کاملImproving the Ant System : A Detailed Report on theMAX { MIN Ant
Ant System is a general purpose heuristic algorithm inspired by the foraging behavior of real ant colonies. Here we introduce an improved version of Ant System, that we called MAX{ MIN Ant System. We describe the new features present in MAX{MIN Ant System, make a detailed experimental investigation on the contribution of the design choices to the improved performance and give computational resu...
متن کاملImproving the Ant System :
Ant System is a general purpose heuristic algorithm inspired by the foraging behavior of real ant colonies. Here we introduce an improved version of Ant System, that we called MAX{ MIN Ant System. We describe the new features present in MAX{MIN Ant System, make a detailed experimental investigation on the contribution of the design choices to the improved performance and give computational resu...
متن کامل